Marshall Rosenbluth and the Metropolis algorithm

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Understanding the Metropolis-Hastings Algorithm

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

The Metropolis-Hastings-Green Algorithm

1.1 Dimension Changing The Metropolis-Hastings-Green algorithm (as opposed to just MetropolisHastings with no Green) is useful for simulating probability distributions that are a mixture of distributions having supports of different dimension. An early example (predating Green’s general formulation) was an MCMC algorithm for simulating spatial point processes (Geyer and Møller, 1994). More wide...

متن کامل

Optimizing and Adapting the Metropolis Algorithm

Many modern scientific questions involve high-dimensional data and complicated statistical models. For example, data on weather consist of huge numbers of measurements across spatial grids, over a period of time. Even in simpler settings, data can be complex: for example, Bartolucci et al. (2007) consider recurrence rates for melanoma (skin cancer) patients after surgery. The probability of rec...

متن کامل

Simple Monte Carlo and the Metropolis algorithm

We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We are interested in analyzing the integration error of optimal algorithms (or the complexity of the problem) with emphasis on the variability of the weight function. For a corresponding large class of problem instances we...

متن کامل

method, Jack measure, and the Metropolis algorithm

Version of 11/13/03 By Jason Fulman University of Pittsburgh Department of Mathematics 301 Thackeray Hall Pittsburgh, PA 15260 Email: [email protected] Abstract: The one parameter family of Jackα measures on partitions is an important discrete analog of Dyson’s β ensembles of random matrix theory. Except for special values of α = 1/2, 1, 2 which have group theoretic interpretations, the Jack...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics of Plasmas

سال: 2005

ISSN: 1070-664X,1089-7674

DOI: 10.1063/1.1887186